Semi-computability of the Fréchet distance between surfaces
نویسندگان
چکیده
The Fréchet distance is a distance measure for parameterized curves or surfaces. Using a discrete approximation, we show that for triangulated surfaces it is upper semi-computable, i.e., there is a non-halting Turing machine which produces a monotone decreasing sequence of rationals converging to the result. It follows that the decision problem, whether the Fréchet distance of two given surfaces lies below some specified value, is recursively enumerable.
منابع مشابه
The Fréchet distance of surfaces is computable
We show that the Fréchet distance of two-dimensional parametrised surfaces in a metric space is computable in the bit-model of real computation. An analogous result in the real RAM model for piecewise-linear surfaces has recently been obtained by Nayyeri and Xu (2016).
متن کاملPartial Matching between Surfaces Using Fréchet Distance
Computing the Fréchet distance for surfaces is a surprisingly hard problem. It has been shown that it is NP-hard to compute the Fréchet distance between many nice classes of surfaces [God98], [Buc10]. On the other hand, a polynomial time algorithm exists for computing the Fréchet distance between simple polygons [Buc06]. This was the first paper to give an algorithm for computing the Fréchet di...
متن کاملComputable Operations on Compact Subsets of Metric Spaces with Applications to Fréchet Distance and Shape Optimization
We extend the Theory of Computation on real numbers, continuous real functions, and bounded closed Euclidean subsets, to compact metric spaces (X, d): thereby generically including computational and optimization problems over higher types, such as the compact ‘hyper’ spaces of (i) nonempty closed subsets of X w.r.t. Hausdorff metric, and of (ii) equicontinuous functions on X . The thus obtained...
متن کاملComputing the Fréchet Distance between Folded Polygons
We present the first results showing that the Fréchet distance between non-flat surfaces can be approximated within a constant factor in polynomial time. Computing the Fréchet distance for surfaces is a surprisingly hard problem. It is not known whether it is computable, it has been shown to be NP-hard, and the only known algorithm computes the Fréchet distance for flat surfaces (Buchin et al.)...
متن کاملar X iv : 1 10 3 . 28 65 v 1 [ cs . C G ] 1 5 M ar 2 01 1 Computing the Fréchet Distance Between Folded Polygons 1
We present the first results showing that the Fréchet distance between non-flat surfaces can be approximated within a constant factor in polynomial time. Computing the Fréchet distance for surfaces is a surprisingly hard problem. It is not known whether it is computable, it has been shown to be NP-hard, and the only known algorithm computes the Fréchet distance for flat surfaces (Buchin et al.)...
متن کامل